Optimal Keyword Auctions with Shadow Costs
نویسندگان
چکیده
Search engines incur shadow costs whenever an advertisement negatively affects user experiences, which damages the search engine’s long-run revenue. We characterize the optimal mechanism for keyword advertising in a general framework that accommodates clickthrough rates and shadow costs that can differ across advertisers and positions. We show that shadow costs significantly affect how advertisers are allocated and the optimal payment rule takes a form of “progressive second price”. Under special cases, the optimal mechanism can be implemented as scoring auctions. Through an analysis of special cases, we obtain insights on how shadow costs impact scoring rules and minimum bid policies and bridge the gap between keyword auction theory and practices.
منابع مشابه
Optimal keyword auctions for optimal user experiences
Poor user experiences with search advertisements can lead to ad avoidance thus reduce search engine’s long-term revenue. We capture the effect of negative user experiences on search engine’s future revenue in a new variable called “shadow costs” and examine the optimal keyword auction mechanisms (KAMs) in a general model that takes into account advertiserspecific and position-specific shadow co...
متن کاملTruthful polynomial time optimal welfare keyword auctions with budget constraints
In keyword auctions, advertisers bid for keywords. Currently, bids and allocations are made on a per keyword basis. We show that this mechanism is neither efficient nor truthful under demand or budget constraints and provide a truthful efficient (quasi) polynomial mechanism for allocating keywords under budget constraints. As a side effect our proposed mechanism has higher revenue than the curr...
متن کاملOptimal Bidding Strategy for Keyword Auctions and Other Continuous-time Markets
This paper models continuous-time mass bidding markets, such as keyword auctions and market-based resource allocation systems, as a stochastic dynamic system that fluctuates around an average value under the influence of its users. The user’s objective to maximize his long-term average utility is formulated as a stochastic control problem. The optimal bidding strategy is calculated both analyti...
متن کاملBid optimization in online advertisement auctions
We consider the problem of online keyword advertising auctions among multiple bidders with limited budgets, and propose a bidding heuristic to optimize the utility for bidders by equalizing the return-on-investment for each bidder across all keywords. We show that natural auction mechanisms combined with this heuristic can experience chaotic cycling (as is the case with many current advertiseme...
متن کاملIs Efficiency Expensive?
We study the simultaneous optimization of efficiency and revenue in pay-per-click keyword auctions in a Bayesian setting. Our main result is that the efficient keyword auction yields near-optimal revenue even under modest competition. In the process, we build on classical results in auction theory to prove that increasing the number of bidders by the number of slots outweighs the benefit of emp...
متن کامل